Hyperbolicity vs. Amenability for Planar Graphs
نویسندگان
چکیده
منابع مشابه
Hyperbolicity vs. Amenability for Planar Graphs
The aim of this paper is to clarify the relationship between Gromovhyperbolicity and amenability for planar maps.
متن کاملGromov Hyperbolicity in Mycielskian Graphs
Since the characterization of Gromov hyperbolic graphs seems a too ambitious task, there are many papers studying the hyperbolicity of several classes of graphs. In this paper, it is proven that every Mycielskian graph GM is hyperbolic and that δ(GM) is comparable to diam(GM). Furthermore, we study the extremal problems of finding the smallest and largest hyperbolicity constants of such graphs;...
متن کاملOn the Hyperbolicity Constant of Line Graphs
If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X. The space X is δ-hyperbolic (in the Gromov sense) if any side of T is contained in a δ-neighborhood of the union of the two other sides, for every geodesic triangle T in X. We denote by δ(X) the sharp hyperbolicity constant of X, i.e., δ(X)...
متن کاملOn the Hyperbolicity of Random Graphs
Let G = (V,E) be a connected graph with the usual (graph) distance metric d : V ×V → N∪{0}. Introduced by Gromov, G is δ-hyperbolic if for every four vertices u, v, x, y ∈ V , the two largest values of the three sums d(u, v) + d(x, y), d(u, x) + d(v, y), d(u, y) + d(v, x) differ by at most 2δ. In this paper, we determine precisely the value of this hyperbolicity for most binomial random graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2017
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-017-9859-x